Cs599: Structure and Dynamics of Networked Information (spring 2005) 04/25/2005: Analysis of Gossip-based Averaging Scribes: David Kempe 1 Averaging Using Gossip
نویسنده
چکیده
In order to analyze this protocol, we will track what “share” of each node j’s number xj is currently contributing to each node’s sum si. So we look at a vector ~vi, in which the j component vi,j denotes the fraction of node j’s value that currently is part of node i’s sum. This means that initially, we have vi,i = 1 for all i, and vi,j = 0 for all i 6= j. In this view, our protocol can be expressed as follows:
منابع مشابه
Information Dissemination via Gossip: Applications to Averaging and Coding
We study distributed algorithms, also known as gossip algorithms, for information dissemination in an arbitrary connected network of nodes. Distributed algorithms have applications to peer-to-peer, sensor, and ad hoc networks, in which nodes operate under limited computational, communication, and energy resources. These constraints naturally give rise to “gossip” algorithms: schemes in which no...
متن کاملCs599: Structure and Dynamics of Networked Information (spring 2005) 02/16/2005: Uniform Labeling Problem Scribes: Yuriy Brun and Nupur Kothari 1 Uniform Labeling Problem via Lp Approximation
In the last lecture, we started studying the uniform labeling problem, where labels are to be assigned to nodes minimizing the combination of two cost objectives: a labeling cost for assigning a particular label at a particular node, and a separation cost for having different labels at adjacent nodes. The problem is known to be NP-hard for 3 or more labels, so we are looking for approximation a...
متن کاملCs599: Structure and Dynamics of Networked Information (spring 2005) 02/23/2005: Rank Aggregation Scribes: Ranjit Raveendran and Animesh Pathak
In previous lectures, we had discussed the problem of searching for relevant results on the WWW by exploiting the link structure. Nowadays, there are already multiple search engines giving quite good results. However, given that there are so many search engines already, employing different techniques, we may be interested in combining their positive features, and constructing a meta-search engi...
متن کاملAccelerated Gossip Algorithms for Distributed Computation
We introduce a technique for accelerating the gossip algorithm of Boyd et. al. (INFOCOM 2005) for distributed averaging in a network. By employing memory in the form of a small shift-register in the computation at each node, we can speed up the algorithm’s convergence by a factor of 10. Our accelerated algorithm is inspired by the observation that the original gossip algorithm is analogous to t...
متن کاملGGRA: a grouped gossip-based reputation aggregation algorithm
An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...
متن کامل